Patrolling a Region with a Structured Swarm of Robots with Limited Individual Capabilities
نویسندگان
چکیده
We present methods for patrolling and surveillance in an environment with a distributed swarm of robots with limited capabilities. We make use of a distributed triangulation of the work space, in which a set of n stationary sensors provides coverage control; in addition, there are k mobile robots that can move between the sensors. Building on our prior work on structured exploration of unknown spaces with multi-robot systems, we can make use of a triangulation that is constructed in a distributed fashion and guarantees good local navigation properties, even when sensors and robots have very limited capabilities. This physical data structure allows triangles to sense, compute, and communicate the information required to guide navigating robots while circulating in the region. We present: 1) A description of a real-world robot platform (the r-one robots) with limited capabilities that allows coverage, communication and mobility 2) A summary of how to achieve coverage by building a triangulation of the workspace, and the ensuing properties. 3) A description of a simple local policy (LRV, for Least Recently Visited) for achieving coverage by the patrolling robots. 4) A description of a alternative local policy (AR, for Age Rank) that identifies important vertices, thus ensuring smaller refresh times for those, and allowing more flexible response to events. 5) Experimental results for both policies.
منابع مشابه
Influence of different execution models on patrolling ant behaviors: from agents to robots
Generally, swarm models and algorithms consider synchronous agents, i.e., they act simultaneously. This hypothesis does not fit multi-agent simulators nor robotic systems. In this paper, we consider such issues on a patrolling ant algorithm. We examine how different execution hypotheses influence self-organization capabilities and patrolling performances of this algorithm. We consider the mono ...
متن کاملA Randomized Gathering Algorithm for Multiple Robots with Limited Sensing Capabilities
Consider a swarm of weak, anonymous and homogeneous robots lacking memory, orientation, and communication capabilities, and having myopic sensors that tell them the directions to nearby robots, but not the distance from them. We present a simple randomized algorithm which, when performed by all members of the swarm, gathers them in a small region. We explore the interesting global phenomena tha...
متن کاملDistributed Approach for Coverage and Patrolling Missions with a Team of Heterogeneous Aerial Robots Under Communication Constraints
Using aerial robots in area coverage applications is an emerging topic. These applications need a coverage path planning algorithm and a coordinated patrolling plan. This paper proposes a distributed approach to coordinate a team of heterogeneous UAVs cooperating efficiently in patrolling missions around irregular areas, with low communication ranges and memory stor...
متن کاملDirect adaptive fuzzy control of flexible-joint robots including actuator dynamics using particle swarm optimization
In this paper a novel direct adaptive fuzzy system is proposed to control flexible-joints robot including actuator dynamics. The design includes two interior loops: the inner loop controls the motor position using proposed approach while the outer loop controls the joint angle of the robot using a PID control law. One novelty of this paper is the use of a PSO algorithm for optimizing the contro...
متن کاملRobust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new ‘Mark-Ant-Walk’ algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark places visited with pheromone marks and sense the level of the pheromone in their local neighborhood. In the case of multiple robots, these pheromone marks can be sensed by all robots and provide the only way of (indirect) comm...
متن کامل